On the Matter of Dynamic Optimality in an Extended Model for Tree Access Operations
نویسنده
چکیده
The model of node access operations taking place in binary search trees subject to rotations is extended to unordered binary trees, as motivated by consideration of certain self-adjusting priority queues. Rotations in this extended model can be preceded by sibling subtree swaps. Whereas the Wilber lower bound for off-line computation extends to this model of computation – a precondition for the possibility of dynamic optimality – the goal of dynamic optimality is nonetheless demonstrated to be unattainable in this model.
منابع مشابه
Does Market Potential Matter? Evidence on the Impact of Market Potential on Economic Growth in Iranian Provinces
T he market potential is an indicator showing the level of market access and national demand for products of a region. The aim of this study is to study the effect of market potential on regional economic growth in 28 Iranian provinces over the years 2001–2011. In order to do that, a model of regional growth was estimated by using Spatial Dynamic Panel Data technique. This technique ...
متن کاملA context-sensitive dynamic role-based access control model for pervasive computing environments
Resources and services are accessible in pervasive computing environments from anywhere and at any time. Also, due to ever-changing nature of such environments, the identity of users is unknown. However, users must be able to access the required resources based on their contexts. These and other similar complexities necessitate dynamic and context-aware access control models for such environmen...
متن کاملOn SOCP/SDP Formulation of the Extended Trust Region Subproblem
We consider the extended trust region subproblem (eTRS) as the minimization of an indefinite quadratic function subject to the intersection of unit ball with a single linear inequality constraint. Using a variation of the S-Lemma, we derive the necessary and sufficient optimality conditions for eTRS. Then, an OCP/SDP formulation is introduced for the problem. Finally, several illustrative examp...
متن کاملCAMAC: a context-aware mandatory access control model
Mandatory access control models have traditionally been employed as a robust security mechanism in multilevel security environments such as military domains. In traditional mandatory models, the security classes associated with entities are context-insensitive. However, context-sensitivity of security classes and flexibility of access control mechanisms may be required especially in pervasive c...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011